Applications of the Matrix Model of Computation

نویسنده

  • Sergio Pissanetzky
چکیده

The Matrix Model of Computation (MMC) is a new Turing-equivalent and Quantumequivalent virtual machine used for the mathematical analysis of systems. The MMC allows uniform techniques to be applied to all kinds of systems and makes them amenable to formal mathematical manipulation. But the strength of the MMC lies in its applications. In this paper we use simple examples to illustrate three very different applications. First, in Physics, we examine a thought experiment in Newtonian Mechanics. The Scope Constriction Algorithm factorizes the equations and discovers a law of Physics. Similar ideas can be applied to compare theories, search for fundamental symmetries, or test new hypotheses. Second, in business, we note that business rules are semantically similar to the MMC and sketch some ideas for their direct conversion to MMC format. Since the MMC is a relational database, and many businesses already use relational databases, we argue that much of the procedure can be automated. Since the MMC is also a program and can be directly compiled, this offers a direct path from business rules to executable code without programming. Lastly, in Software Engineering, we examine relationships between the MMC and UML class models, MMC support for encapsulation, inheritance and polymorphism, and the use of the MMC for refactoring OO code.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Projected Alternating Least square Approach for Computation of Nonnegative Matrix Factorization

Nonnegative matrix factorization (NMF) is a common method in data mining that have been used in different applications as a dimension reduction, classification or clustering method. Methods in alternating least square (ALS) approach usually used to solve this non-convex minimization problem.  At each step of ALS algorithms two convex least square problems should be solved, which causes high com...

متن کامل

ON THE FUNCTION OF BLOCK ANTI DIAGONAL MATRICES AND ITS APPLICATION

The matrix functions appear in several applications in engineering and sciences. The computation of these functions almost involved complicated theory. Thus, improving the concept theoretically seems unavoidable to obtain some new relations and algorithms for evaluating these functions. The aim of this paper is proposing some new reciprocal for the function of block anti diagonal matrices. More...

متن کامل

A STABLE COUPLED NEWTON'S ITERATION FOR THE MATRIX INVERSE $P$-TH ROOT

The computation of the inverse roots of matrices arises in evaluating non-symmetriceigenvalue problems, solving nonlinear matrix equations, computing some matrixfunctions, control theory and several other areas of applications. It is possible toapproximate the matrix inverse pth roots by exploiting a specialized version of New-ton's method, but previous researchers have mentioned that some iter...

متن کامل

Reinforced Soil Wall Analysis under Working Stress Conditions Using a Two Phase Model with the Introduction of a New Design Parameter

A previously introduced two phase model was used to assess its capability in predicting the behavior of reinforced soil walls under working stress conditions. The two phase model is a homogenization method based on the virtual work theorem. The reinforced soil medium is considered as the superposition of two continuous phases, the reinforcement and matrix phases that interact within the medium....

متن کامل

On Conditional Applications of Matrix Variate Normal Distribution

In this paper, by conditioning on the matrix variate normal distribution (MVND) the construction of the matrix t-type family is considered, thus providing a new perspective of this family. Some important statistical characteristics are given. The presented t-type family is an extension to the work of Dickey [8]. A Bayes estimator for the column covariance matrix &Sigma of MVND is derived under ...

متن کامل

Computation of the q-th roots of circulant matrices

In this paper, we investigate the reduced form of circulant matrices and we show that the problem of computing the q-th roots of a nonsingular circulant matrix A can be reduced to that of computing the q-th roots of two half size matrices B - C and B + C.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008